Change of Ordering for Regular Chains in Positive Dimension
نویسندگان
چکیده
We discuss changing the variable ordering for a regular chain in positive dimension. This quite general question has applications going from implicitization problems to the symbolic resolution of some systems of differential algebraic equations. We propose a modular method, reducing the problem to dimension zero and using Newton-Hensel lifting techniques. The problems raised by the choice of the specialization points, the lack of the (crucial) information of what are the free and algebraic variables for the new ordering, and the efficiency regarding the other methods are discussed. Strong hypotheses (but not unusual) for the initial regular chain are required. Change of ordering in dimension zero is taken as a subroutine. We report on an implementation of our method realized in Maple within the RegularChains library.
منابع مشابه
OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملImpact of government’s policies on competition of two closed-loop and regular supply chains
With progressing technologies and new features of production, new products compete with older ones in markets. Indeed, new products initiate contest with olden ones and this process repeats in different productions lifetime several times. In this situation recycling the olden products seems to be significant for supply chains. Governments often levy special tariffs for these products as a contr...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملChange of order for regular chains in positive dimension
This is also an example of an implicitization problem. Main result. Let C be a regular chain, whose saturated ideal is prime. We give a probabilistic algorithm, of complexity polynomial in the size of input (degree, complexity of evaluation) and output (number of monomials), and in the degree of the quasi-component of C. Let d be the maximum degree in C, let n be the number of variables. If all...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کامل